Non - Reversible Golomb - Rice Code with k = 1 Reversible Golomb - Rice Code with k = 1
نویسنده
چکیده
The International Telecommunications Union (ITU) recently adopted reversible variable length codes (RVLCs) for use in the emerging H.263+ video compression standard. As the name suggests, these codes can be decoded in two directions and can therefore be used by a decoder to enhance robustness in the presence of transmission bit errors. In addition, these RVLCs involve little or no eeciency loss relative to the corresponding non-reversible variable length codes. We present here the ideas behind two general classes of RVLCs and discuss the results of applying these codes in the framework of the H.263+ and MPEG-4 video coding standards.
منابع مشابه
A Class of Reversible Variable Length Codes for Robust Image and Video Coding
We describe a class of parameterized reversible variable length codes that have length distributions identical to Golomb-Rice codes and exp-Golomb codes. The pdfs to which these codes correspond are well matched to statistics of image and video data, thus enabling an increase in robustness to channel errors with no penalty in coding e ciency. These codes are applicable to MPEG-4 and other algor...
متن کاملImproved entropy coding for quantized transform coefficients in HEVC screen content coding
In the emerging high efficiency video coding (HEVC) standard, a Golomb-Rice code is adopted to binarize level information. The Golomb-Rice code is optimal for encoding symbols with the exponential probability distribution. In general, quantized transform coefficients of natural images show the exponential probability distribution. However, screen contents usually have a totally different probab...
متن کاملDesign of a Hybrid Quantizer with Variable Length Code
In this paper a new model for compression of Laplacian source is given. This model consists of hybrid quantizer whose output levels are coded with Golomb-Rice code. Hybrid quantizer is combination of uniform and nonuniform quantizer, and it can be considered as generalized quantizer, whose special cases are uniform and nonuniform quantizers. We propose new generalized optimal compression functi...
متن کاملSelecting the Golomb Parameter in Rice Coding
We examine the use of Golomb-power-of-2 (GPO2) codes to efficiently and losslessly encode sequences of nonnegative integers from a discrete source. Specifically, we’re interested in the problem of selecting which GPO2 code to use for a source or a block of samples; this problem is at the heart of the well-known Rice entropy coding algorithm. We’re particularly concerned with the case where the ...
متن کاملRe-Ordered FEGC and Block Based FEGC for Inverted File Compression
Data compression has been widely used in many Information Retrieval based applications like web search engines, digital libraries, etc. to enable the retrieval of data to be faster. In these applications, universal codes (Elias codes (EC), Fibonacci code (FC), Rice code (RC), Extended Golomb code (EGC), Fast Extended Golomb code (FEGC) etc.) have been preferably used than statistical codes (Huf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998